An Adaptive Linear Approximation Algorithm for Copositive Programs
نویسندگان
چکیده
منابع مشابه
An Adaptive Linear Approximation Algorithm for Copositive Programs
We study linear optimization problems over the cone of copositive matrices. These problems appear in nonconvex quadratic and binary optimization; for instance, the maximum clique problem and other combinatorial problems can be reformulated as such problems. We present new polyhedral inner and outer approximations of the copositive cone which we show to be exact in the limit. In contrast to prev...
متن کاملA Distributed Approximation Algorithm for Mixed Packing-Covering Linear Programs
Mixed packing-covering linear programs capture a simple but expressive subclass of linear programs. They commonly arise as linear programming relaxations of a number important combinatorial problems, including various network design and generalized matching problems. In this paper, we propose an efficient distributed approximation algorithm for solving mixed packing-covering problems which requ...
متن کاملAn algorithm for determining copositive matrices
In this paper, we present an algorithm of simple exponential growth called COPOMATRIX for determining the copositivity of a real symmetric matrix. The core of this algorithm is a decomposition theorem, which is used to deal with simplicial subdivision of T̂ = {y ∈ ∆m|β y ≤ 0} on the standard simplex ∆m, where each component of the vector β is -1, 0 or 1.
متن کاملWeak Copositive and Intertwining Approximation
It is known that shape preserving approximation has lower rates than unconstrained approximation. This is especially true for copositive and intertwining approximations. For f 2 L p , 1 p < 1, the former only has rate ! ' (f; n ?1) p , and the latter can not even be bounded by Ckfk p. In this paper, we discuss various ways to relax the restrictions in these approximations and conclude that the ...
متن کاملAn Exponential Approximation Algorithm in Linear Programming
The algorithm determines a non-iteration procedure for computing the optimal solution of a linear programming problem. We consider approximating system of linear equations to determine the optimal basis variables of the linear programming problem. The usefulness of the algorithm is illustrated by a numerical example. © 2014 The Authors. Published by Elsevier B.V. Selection and peer-review under...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2009
ISSN: 1052-6234,1095-7189
DOI: 10.1137/070711815